An Improved Farmland Fertility Algorithm with Hyper-Heuristic Approach for Solving Travelling Salesman Problem

Travelling Salesman Problem (TSP) is a discrete hybrid optimization problem considered NP-hard. TSP aims to discover the shortest Hamilton route that visits each city precisely once and then returns starting point, making it feasible. This paper employed Farmland Fertility Algorithm (FFA) inspired by agricultural land fertility hyper-heuristic technique based on Modified Choice Function (MCF). The neighborhood search operator can use this strategy automatically select best heuristic method for decision. Lin-Kernighan (LK) local has been incorporated increase efficiency performance of suggested approach. 71 TSPLIB datasets have compared with different algorithms prove proposed algorithm’s efficiency. Simulation results indicated algorithm outperforms comparable methods average mean computation time, percentage deviation (PDav), tour length.